Descent-Cycling in Schubert Calculus

نویسنده

  • Allen Knutson
چکیده

CONTENTS We prove two lemmata about Schubert calculus on generalized 1. Background on Schubert Problems f|ag manifolds G/B, and in the case of the ordinary flag manifold 2. The Schubert Problems Graph and Its Structure for Small GLn/B we interpret them combinatorially in terms of descents, GLn(C) and geometrically in terms of missing subspaces. One of them 3. Proofs of the Lemmata gives a symmetry of Schubert calculus that we christen descent4. A Geometrical Interpretation cycling. Computer experiment shows these two lemmata are M k' R I surprisingly powerful: they already suffice to determine all of GLn Schubert calculus through n = 5, and 99.97%+ at n = 6. ^ ^ We use them to give a quick proof of Monk's rule. The lemmata Acknowledgements a ! s o h o | d j n e q u i v a r jant ("double") Schubert calculus for KacAddendum Moody groups G. References

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Experimentation in the Schubert Calculus

Many aspects of Schubert calculus are easily modeled on a computer. This enables large-scale experimentation to investigate subtle and ill-understood phenomena in the Schubert calculus. A well-known web of conjectures and results in the real Schubert calculus has been inspired by this continuing experimentation. A similarly rich story concerning intrinsic structure, or Galois groups, of Schuber...

متن کامل

Decoding of Subspace Codes, a Problem of Schubert Calculus over Finite Fields

Schubert calculus provides algebraic tools to solve enumerative problems. There have been several applied problems in systems theory, linear algebra and physics which were studied by means of Schubert calculus. The method is most powerful when the base field is algebraically closed. In this article we first review some of the successes Schubert calculus had in the past. Then we show how the pro...

متن کامل

Certifiable Numerical Computations in Schubert Calculus

Traditional formulations of geometric problems from the Schubert calculus, either in Plücker coordinates or in local coordinates provided by Schubert cells, yield systems of polynomials that are typically far from complete intersections and (in local coordinates) typically of degree exceeding two. We present an alternative primal-dual formulation using parametrizations of Schubert cells in the ...

متن کامل

Vanishing and Non-Vanishing Criteria for Branching Schubert Calculus by

Vanishing and Non-Vanishing Criteria for Branching Schubert Calculus by Kevin Purbhoo Doctor of Philosophy in Mathematics University of California at Berkeley Professor Allen Knutson, Chair We investigate several related vanishing problems in Schubert calculus. First we consider the multiplication problem. For any complex reductive Lie group G, many of the structure constants of the ordinary co...

متن کامل

Schubert Calculus and Puzzles

1. Interval positroid varieties 1 1.1. Schubert varieties 1 1.2. Schubert calculus 2 1.3. First positivity result 3 1.4. Interval rank varieties 5 2. Vakil’s Littlewood-Richardson rule 7 2.1. Combinatorial shifting 7 2.2. Geometric shifting 7 2.3. Vakil’s degeneration order 9 2.4. Partial puzzles 10 3. Equivariant and Kextensions 11 3.1. K-homology 11 3.2. K-cohomology 12 3.3. Equivariant K-the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Experimental Mathematics

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2001